A Lagrangian heuristic for satellite range scheduling with resource constraints
نویسندگان
چکیده
منابع مشابه
A Lagrangian heuristic for satellite range scheduling with resource constraints
The task of scheduling communications between satellites and ground control stations is getting more and more critical since an increasing number of satellites must be controlled by a small set of stations. In such a congested scenario, the current practice, in which experts build hand-made schedules, often leaves a large number of communication requests unserved. We report on our experience in...
متن کاملA Heuristic Scheduling Algorithm for Distributed Systems with Workflow Constraints
Distributed systems become one of the most important computing platform because they can efficiently handle large amount of data with a high computing workload. However, the job scheduling in the distributed systems is not a trivial issue. It can be even more complex when dealing with workflow-based composite jobs, i.e., each job has multiple tasks with dependencies between them. As the job sch...
متن کاملBounds for Multiprocessor Scheduling with Resource Constraints
One well-studied model of a multiprocessing system involves a fixed number n of identical abstract processors, a finite set of tasks to be executed, each requiring a specified amount of computation time, and a partial ordering on the tasks which requires certain tasks to be completed before certain others can be initiated. The nonpreemptive operation of the system is guided by an ordered list L...
متن کاملSimple and integrated heuristic algorithms for scheduling tasks with time and resource constraints
We consider the problem of scheduling a set of n tasks in a system having r resources. Each task has an arbitrary, but known, processing time and a deadline, and may request use of a number of resources. A resource can be used either in shared mode or exclusive mode. In this article, we study algorithms used for determining whether or not a set of tasks is schedulable in such a system, and if s...
متن کاملHeuristic Methods for Problems with Blocking Constraints Solving Jobshop Scheduling
Jobshop problem is one of the most difficult classical scheduling problems. Very simple special cases of jobshop problem are strongly NP-hard. This paper deals with makespan minimization in jobshop scheduling problems with a specific blocking constraint met in several industrial problems. We also propose and define another new type of blocking constraint. After a problem description and the def...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2011
ISSN: 0305-0548
DOI: 10.1016/j.cor.2011.01.016